
public class Test {

    public static void main(String[] args) {
        BinaryTree binaryTree = new BinaryTree();
        BinaryTree.TreeNode root = binaryTree.createTree();
        binaryTree.preOrder(root);
        System.out.println();
        binaryTree.inOrder(root);
        System.out.println();
        binaryTree.postOrder(root);
        System.out.println("节点个数");
        System.out.println(binaryTree.size(root));
        System.out.println(binaryTree.size2(root));
        System.out.println(binaryTree.getLeafNodeCount(root));
        System.out.println(binaryTree.getLeafNodeCount2(root));
        System.out.println("=====第K层节点的个数===========");
        System.out.println(binaryTree.getKleveNodeCount(root,4));
        System.out.println(binaryTree.getHeight(root));
        System.out.println("=====查找===========");
        BinaryTree.TreeNode ret = binaryTree.find(root,'E');
        System.out.println(ret.val);
        binaryTree.levelOrder(root);
        System.out.println();
        System.out.println("判断是否为一个完全二叉树");
        System.out.println(binaryTree.isCompleteTree(root));

    }
}
